[20250204] BOJ / 골드5 / 주사위 쌓기 / 설진영 #31
Merged
Conversation
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
🧷 문제 링크
https://www.acmicpc.net/problem/2116
🧭 풀이 시간
30분
👀 체감 난이도
✏️ 문제 설명
순서대로 주사위 정보 주고, 차례대로 쌓는데, 맞닿는 면이 같은 숫자일때,
주사위 숫자 한 면의 총 합의 최대 구하기
🔍 풀이 방법
첫 번째 주사위를 6번 돌리면서, 각각 주사위를 쌓고, 각 면 최댓값 합의 최대를 구하면 됨
객체지향으로 푸니 이해하기 쉬움
⏳ 회고
단순 구현문제인데 3D 문제고, 내가 머리가 약간 안좋다 싶으면 객체지향적으로 짜면 훨씬 덜 햇갈리고 직관적인거 같음.
속도랑 메모리는 마이너스가 있을듯